Biconditional Binary Decision Diagrams: A Novel Canonical Logic Representation Form
نویسندگان
چکیده
منابع مشابه
Restructuring of Arithmetic Circuits with Biconditional Binary Decision Diagrams
Biconditional Binary Decision Diagrams (BBDDs) are a novel class of canonical binary decision diagrams where the branching condition, and its associated logic expansion, is biconditional on two variables. In this demonstration, we use an efficient BBDD manipulation package as front-end to a commercial synthesis tool to restructure arithmetic operations in critical components of telecommunicatio...
متن کاملEquational Binary Decision Diagrams Equational Binary Decision Diagrams
We incorporate equations in binary decision diagrams (BDD). The resulting objects are called EQ-BDDs. A straightforward notion of ordered EQ-BDDs (EQ-OBDD) is de ned, and it is proved that each EQ-BDD is logically equivalent to an EQ-OBDD. Moreover, on EQ-OBDDs satis ability and tautology checking can be done in constant time. Several procedures to eliminate equality from BDDs have been reporte...
متن کاملRough set data representation using binary decision diagrams
A new information system representation, which inherently represents indiscernibility is presented. The basic structure of this representation is a Binary Decision Diagram. We offer testing results for converting large data sets into a Binary Decision Diagram Information System representation, and show how indiscernibility can be efficiently determined. Furthermore, a Binary Decision Diagram is...
متن کاملA Canonical Form for Circuit Diagrams
A canonical form for circuit diagrams with a designated start state is presented. The form is based upon nite automata minimization and Shannon's canonical form for boolean expressions.
متن کاملBinary decision diagrams for first-order predicate logic
Binary decision diagrams (BDDs) are known to be a very efficient technique to handle propositional formulas. We present an extension of BDDs such that they can be used for predicate logic. We define BDDs similar to Bryant [IEEE Trans. Comp. C-35 (1986) 677–691], but with the difference that we allow predicates as labels instead of proposition symbols. We present a sound and complete proof searc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Journal on Emerging and Selected Topics in Circuits and Systems
سال: 2014
ISSN: 2156-3357,2156-3365
DOI: 10.1109/jetcas.2014.2361058